Hypergraph based geometric biclustering algorithm

0167-8655/$ see front matter 2012 Elsevier B.V. A http://dx.doi.org/10.1016/j.patrec.2012.05.001 ⇑ Corresponding author. E-mail addresses: [email protected] gmail.com (C.W. Yu), [email protected] (R.C.C. (H. Yan). In this paper, we present a hypergraph based geometric biclustering (HGBC) algorithm. In a high dimensional space, bicluster patterns to be recognized can be considered to be linear geometrical structures. We can use the Hough transform (HT) to find sub-biclusters which correspond to the linear structures in column-pair spaces. Then a hypergraph model is built to merge the sub-biclusters into larger ones. Experiments on simulated and real biological data show that the HGBC algorithm proposed here can combine the sub-biclusters efficiently and provide more accurate classification results compared with existing biclustering methods. 2012 Elsevier B.V. All rights reserved.